A variational model for equilibrium problems in a traffic network

نویسندگان

  • Giandomenico Mastroeni
  • Massimo Pappalardo
چکیده

We propose a variational model for one of the most important problems in traffic networks, namely, the network equilibrium flow that is, traditionally in the context of operations research, characterized by minimum cost flow. This model has the peculiarity of being formulated by means of a suitable variational inequality (VI) and its solution is called “equilibrium”. This model becomes a minimum cost model when the cost function is separable or, more general, when the Jacobian of the cost operator is symmetric; in such cases a functional representing the total network utility exists. In fact in these cases we can write the first order optimality conditions which turn out to be a VI. In the other situations (i.e., when global utility functional does not exist), which occur much more often in the real problems, we can study the network by looking for equilibrium solutions instead of minimum points. The Lagrangean approach to the study of the VI allows us to introduce dual variables, associated to the constraints of the feasible set, which may receive interesting interpretations in terms of potentials associated to the arcs and the nodes of the network. This interpretation is an extension and generalization of the classic Bellman conditions. Finally, we deepen the analysis of the networks having capacity constraints.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hölder continuity of a parametric variational inequality

‎In this paper‎, ‎we study the Hölder continuity of solution mapping to a parametric variational inequality‎. ‎At first‎, ‎recalling a real-valued gap function of the problem‎, ‎we discuss the Lipschitz continuity of the gap function‎. ‎Then under the strong monotonicity‎, ‎we establish the Hölder continuity of the single-valued solution mapping for the problem‎. ‎Finally‎, ‎we apply these resu...

متن کامل

Different Network Performance Measures in a Multi-Objective Traffic Assignment Problem

Traffic assignment algorithms are used to determine possible use of paths between origin-destination pairs and predict traffic flow in network links. One of the main deficiencies of ordinary traffic assignment methods is that in most of them one measure (mostly travel time) is usually included in objective function and other effective performance measures in traffic assignment are not considere...

متن کامل

An Iterative Scheme for Generalized Equilibrium, Variational Inequality and Fixed Point Problems Based on the Extragradient Method

The problem ofgeneralized equilibrium problem is very general in the different subjects .Optimization problems, variational inequalities, Nash equilibrium problem and minimax problems are as special cases of generalized equilibrium problem. The purpose of this paper is to investigate the problem of approximating a common element of the set of generalized equilibrium problem, variational inequal...

متن کامل

The Equilibrium Equivalent Representation for Variational Inequalities Problems with Its Application in Mixed Traffic Flows

In this paper, we first introduce the relationship between the Hartman-Stampacchia variational inequalities (VI) problems and equilibrium programming (EP), and we present EP equivalent representation for Hartman-Stampacchia VI problems. After analyze and discuss the condition for optimization of EP, and the relation with the model transformation equivalent applied in mixed traffic assignment pr...

متن کامل

Strong convergence of a general implicit algorithm for variational inequality problems and equilibrium problems and a continuous representation of nonexpansive mappings

We introduce a general implicit algorithm for finding a common element of‎ ‎the set of solutions of systems of equilibrium problems and the set of common fixed points‎ ‎of a sequence of nonexpansive mappings and a continuous representation of nonexpansive mappings‎. ‎Then we prove the strong convergence of the proposed implicit scheme to the unique solution of the minimization problem on the so...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • RAIRO - Operations Research

دوره 38  شماره 

صفحات  -

تاریخ انتشار 2004